Free and locally free arrangements with a given intersection lattice
نویسندگان
چکیده
منابع مشابه
Matroid Representations and Free Arrangements
We show that Terao's Conjecture ("Freeness of the module of logarithmic forms at a hyperplane arrangement is determined by its abstract matroid") holds over fields with at most four elements. However, an example demonstrates that the field characteristic has to be fixed for this. 1. Free arrangements The present study continues an investigation of the connection between algebraic and combinator...
متن کاملIntersection Free Simplification
Triangle mesh decimation and multi-resolution techniques are widely used in visualization applications for huge scenes. A large collection of different simplification algorithms exists in order to build a multi-resolution model from a given triangle mesh. All of the existing approaches focus on the creation of a geometrically close approximation of the original model. In order to produce a simp...
متن کاملLocally Free Sheaves
In these talks we will discuss several important examples of locally free sheaves and see the connection between locally free sheaves and finitely generated projective modules. In addition, we will see the connection between the divisor class group and the Picard group (aka ideal class group) of a domain. The bulk of this talk is taken from Sections 5 and 6 of Chapter II of [3]. Proofs of the v...
متن کاملGuaranteed intersection-free polygon morphing
We present a method for naturally and continuously morphing two simple planar polygons with corresponding vertices in a manner that guarantees that the intermediate polygons are also simple. This contrasts with all existing polygon morphing schemes who cannot guarantee the non-self-intersection property on a global scale, due to the heuristics they employ. Our method achieves this property by r...
متن کاملMaximum Order of Triangle-Free Graphs with a Given Rank
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced triangle-free graphs with a given rank and characterize all such graphs achieving the maximum order.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1993
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1993-1160307-6